The Computational Complexity of Games and Puzzles
نویسنده
چکیده
The subject of my thesis is studying the algorithmic properties of one and two-player games people enjoy playing, such as chess or Sudoku. This research falls into a wider area known as combinatorial game theory. One of the main questions asked about games in this context is whether they are algorithmically tractable, that is, whether they can be solved with efficient algorithms. So far, more than fifty popular games have been categorized as intractable. This is probably because people enjoy games and puzzles for which designing a winning strategy or finding the solution requires some cleverness.
منابع مشابه
Computer Science Through Urn Games: An Unified Framework for a Hierarchy of Solvable and Unsolvable Problems
Abstract. In his last published paper, Solvable and Unsolvable Problems, printed in 1954 in the popular journal Science News, Alan Turing presented several elegant puzzles aiming at explaining and popularizing problems for which there are algorithms for solutions – the solvable – as well as some for which no such algorithmic solution exists the unsolvable. This paper could be seen as a continua...
متن کاملPlaying Games with Algorithms: Algorithmic Combinatorial Game Theory
Combinatorial games lead to several interesting, clean problems in algorithms and complexity theory, many of which remain open. The purpose of this paper is to provide an overview of the area to encourage further research. In particular, we begin with general background in Combinatorial Game Theory, which analyzes ideal play in perfect-information games, and Constraint Logic, which provides a f...
متن کاملThe Lemmings Puzzle: Computational Complexity of an Approach and Identification of Difficult Instances
Artificial Intelligence can be thought of as the study of machines that are capable of solving problems that require human level intelligence. It has frequently been concerned with game playing. In this thesis we shall focus on the areas of search and complexity, with respect to single-player games. These types of games are called puzzles. Puzzles have received research attention for some decad...
متن کاملSimple Amazons Endgames and Their Connection to Hamilton Circuits in Cubic Subgrid Graphs
Amazons is a young board game with simple rules and a high branching factor, which makes it a suitable test-bed for planning research. This paper considers the computational complexity of amazons puzzles and restricted amazons endgames. We rst prove the NP{ completeness of the Hamilton circuit problem for cubic subgraphs of the integer grid. This result is then used to show that solving amazons...
متن کاملThe Complexity of Snake
Snake and Nibbler are two well-known video games in which a snake slithers through a maze and grows as it collects food. During this process, the snake must avoid any collision with its tail. Various goals can be associated with these video games, such as avoiding the tail as long as possible, or collecting a certain amount of food, or reaching some target location. Unfortunately, like many oth...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013